//
// Created by WangTao on 2020/3/7.
//(1,9,2,5,7,3,4,6,8,0)中最长的递增子序列为(3,4,6,8)。
// 15
//1 9 2 5 7 3 4 6 8 0 11 15 17 17 10
//
#include <stdio.h>
#include <stdlib.h>


void printArray(int arr[], int length) {
    int i;
    for (i = 0; i < length; i++) {
        printf("%d", arr[i]);
        if (i != length-1){
            printf(" ");
        }
    }
}

void findMaxOrderArray(int arr[],int length){
    int i = 0;
    int max=0;
    int tmp=0;
    int j;
    for (j = 0; j < length; j++) {
        if(arr[j] > arr[j+1]){
            i = j;
            tmp= j - i;
            if(tmp > max){
                max = tmp;
            }
        }
    }
    printf("max length is %d,start index is %d",length,i);


}

int main(){

    int N;
    scanf("%d",&N);
    int i;
    int arr[N];
    for (i = 0; i < N; i++) {
        scanf("%d",&arr[i]);
    }
    return 0;
}
